Application of Attribute NCE Graph Grammars to Syntactic Editing of Tabular Forms
نویسندگان
چکیده
In this paper, we deal with editing tabular forms for program specifications based on a particular graph grammar HNGG [2]. First, we formalize syntax-directed editing methods by extending of the notion of the Cornell Program Synthesizer [8] to attribute NCE graph grammars (cf. [1]). Next, we discuss the algorithms of the editing methods. keyword Graph Grammars, Visual Programming, Software Development, Syntax-Directed Editors
منابع مشابه
Syntactic Processing of Diagrams by Graph Grammars
We deal with syntactic definitions and processing of program diagrams based on graph grammars with respect to the mechanical drawing. We propose an attribute NCE graph grammar of hierarchical diagrams such as structured program diagrams. We also propose attribute context-free and context-sensitive NCE graph grammars for nested and tessellation diagrams, respectively. Attribute rules are used fo...
متن کاملAn XML Viewer for Tabular Forms for Use with Mechanical Documentation
We deal with mechanical documentation in software development tools. First, we review tabular forms for program specification and their formal syntax by an attribute edNCE graph grammar. Next we explain a parser based on the syntactic definitions and attribute rules. Furthermore, we introduce an XML viewer for tabular forms based on the attribute graph grammar. Finally, we introduce a system st...
متن کاملNCE Graph Grammars and Clique-Width
Graph grammars are widely used in order to deene classes of graphs having some inductive and narrow structure. In many cases the narrowness can be measured in terms of the maximal tree-width and/or clique-width of the graphs in the class, (see RS86],,CO00] for deenitions of these notions). It is known that using the corresponding tree-decomposition or clique-width parse term, any property of th...
متن کاملThe Bounded Tree-Width Problem of Context-Free Graph Languages
We show that the following (equivalent) problems are P-complete: 1. Does a given connuent NCE graph grammar only generate graphs of bounded tree-width? and 2. is the graph language generated by a given connuent NCE graph grammar an HR language? This settles the complexity of these important problems on graph grammars .
متن کاملPractical Applications of Precedence Graph Grammars
Precedence graph grammars are of major interest in all those applications of graph grammars, where highly efficient parsers are needed. Up to now there are no other graph parsers with the same performance. Due to the fact, that even regular graph grammars with very restricted embedding relations have a NP-complete membership problem, different kinds than Chomsky-like restrictions have to be imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 50 شماره
صفحات -
تاریخ انتشار 2001